Approximate String Matching and the Automation of Word Games
نویسندگان
چکیده
In this paper we discuss the utility of approximate string matching procedures in the automation of various aspects of word game construction and solution. These procedures are then related to the underlying issues in computational linguistics.
منابع مشابه
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
This paper deals with the approximate string-matching problem with Hamming distance. The approximate string-matching with kmismatches problem is to find all locations at which a query of length m matches a factor of a text of length n with k or fewer mismatches. The approximate string-matching algorithms have both pleasing theoretical features, as well as direct applications, especially in comp...
متن کاملApplications of Approximate Word Matching in InformationRetrievalJames
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the eeective retrieval of information. The need to discover and reconcile variant forms of strings in bibliographic entries, i.e., authority work, will become more diicult. Spelling variants, misspellings, and transliteration diiere...
متن کاملFast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The technique is applied to approximate string matching under Hamming distance. The obtained algorithms are the fastest known. In particular, we reduce the complexity of the Amir et al. [1] algorithm for k-mismatches from O(n √...
متن کاملA Fast Heuristic forApproximate String Matching 2
We study a fast algorithm for on-line approximate string matching. It is based on a non-deterministic nite automaton, which is simulated using bit-parallelism. If the automaton does not t in a computer word, we partition the problem into subproblems. We show experimentally that this algorithm is the fastest for typical text search. We also show which algorithms are the best in other cases, and ...
متن کاملApproximate String Matching: Theory and Applications (La Recherche Approchée de Motifs : Théorie et Applications)
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows : Let D = {x1, x2, . . . xd} be a set of d words defined on an alphabet Σ, let q be a query defined also on Σ, and let k be a positive integer. We want to build a data structure on D capable of answering the following query : find all words i...
متن کامل